Designing FPT Algorithms for Cut Problems Using Randomized Contractions
نویسندگان
چکیده
منابع مشابه
FPT Algorithms for Plane Completion Problems
The Plane Subgraph (resp. Topological Minor) Completion problem asks, given a (possibly disconnected) plane (multi)graph Γ and a connected plane (multi)graph ∆, whether it is possible to add edges in Γ without violating the planarity of its embedding so that it contains some subgraph (resp. topological minor) that is topologically isomorphic to ∆. We give FPT algorithms that solve both problems...
متن کاملFPT-algorithms for some problems related to integer programming
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The parameter is the maximum absolute value of rank minors of the corresponding matrices. Additionally, we present FPT-algorithms with respect to the same parameter for...
متن کاملAlgorithms for 2-Route Cut Problems
In this paper we study approximation algorithms for multiroute cut problems in undirected graphs. In these problems the goal is to find a minimum cost set of edges to be removed from a given graph such that the edge-connectivity (or node-connectivity) between certain pairs of nodes is reduced below a given threshold K. In the usual cut problems the edge connectivity is required to be reduced be...
متن کاملAlgorithms for Cut Problems on Trees
We study the multicut on trees and the generalized multiway Cut on trees problems. For the multicut on trees problem, we present a parameterized algorithm that runs in time O(ρ), where ρ = √√ 2 + 1 ≈ 1.555 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen et al. that runs in time O(1.619). For the generalized multiway cut on trees problem, we show...
متن کاملRandomized Algorithms for Graph Problems
Randomization is a powerful tool in the design of algorithms. In this proposal we use randomness to make progress on several old and fundamental problems. We close the approximability of feedback arc set on tournament graphs, first studied around 1961 [16], by designing a PTAS. We give a practical algorithm with improved performance for finding strongly connected components in parallel (first s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/15m1032077